node of graph
英 [nəʊd ɒv ɡræf]
美 [noʊd əv ɡræf]
【计】图节点
双语例句
- You can visualize a DirectedGraph as a2-D graph that has a finite number of Nodes, with each Node located at some Point, and the adjacent Nodes joined ( or connected) to each other by Edges.
您可以将DirectedGraph形象化为拥有有限数量的Node的一个2-D图形，在该图形中，每个Node都位于一些Point上，相邻的Node是通过Edges连接在一起的。 - There is an attribute RUNSTATS TIMESTAMP on the table or index node of the access plan graph that indicates the last time when the statistics were collected.
在访问计划图的表或索引节点上会有一个RUNSTATSTIMESTAMP属性，它表示收集统计数据的时间。 - The first part of the query finds the node that represents me in the FOAF file, and then finds the names of the people that the graph says I know.
查询的第一部分找到了FOAF文件中代表我的那些节点，然后找到了图中描述的、我认识的那些人的名字。 - Unlike other databases which store their data in rows, columns or key-value pairs a graph database stores all information in a network of nodes and edges.
和其他以列、行或者键/值等形式存储数据的数据库不同，图形数据库以节点（Node）和边（Edge）的网络存储所有信息。 - Hopfield gives a method for finding the shortest Hamilton cycle using neural networks in N node complete graph Kn. In non-selfloop graph is regarded as the subgraph of KN, it will be easy to Obtain Hamilton cycle of Hamilton graph.
Hopfield给出N个节点完全图KN中求最短Hamilton圈的神经网络方法，若将无自环图看做KN的子图，不难求出Hamilton图的Hamilton圈。 - According to node and link shared wavelength-convertible switch architectures, a construction method of the layered graph model was proposed for all-optical networks. The sub-problems of routing and wavelength assignment were converted to the shortest path problem in the layered graph.
针对节点共享和链路共享波长转换器的节点交换结构，提出了全光网的分层图模型构造方法，将路由和波长分配两个子问题转化为在分层图中求解最短路问题。 - To meet the needs of its application in the finite element method calculation, additional definitions of the node of network in graph theory are made.
结合有限元素法计算中应用的需要对图论中网络节点的有关定义作了适当的补充。 - In this paper introduced a method of converting the intersection of node pair to the nesting of them, by using the concept of combined node pairs, then the graph method, which simulated the case of nesting of node pairs, can be applied.
本文利用合成节点对的概念将节点对的交叉情况变换成节点对的嵌套情况，然后就可以应用图形法像处理嵌套的情况那样进行模拟。 - According to the condition of each node and using the problem of graph division as model, the assignment of threads is based on Genetic Algorithms, thereby new way to solve this problem is provided.
该方法根据网络中各个节点的使用状况，以图分割问题为模型，利用遗传算法对线程进行合理分配，从而为解决该问题提供了新途径。 - This method ranks the node importance over all nodes in a network. The relative importance of two nodes in a graph is compared in terms of the number of spanning trees.
该方法可以评价全网范围内的节点重要性，通过比较生成树的数目，可以判断通信网中任意两个节点的相对重要性。 - This article intended to introduce the idea of generalized node point, and to give an expressive method of graph.
试图提出广义结点概念，并给出图的一种表示方法。 - Based on the available data files on node and the degree of node, the graph of the distributed system can be reduced by using the Degree-1 reduction algorithm and the Series reduction algorithm, thus the complex degree of evaluation can be reduced.
根据节点上可用的数据文件和节点的度数，Degree-1精简算法和Series精简算法分别对分布式系统示意图进行度1精简和度2精简，降低了评估阶段的复杂度； - Node Aggregation of Bayesian Network Based on Chain Graph
基于链图的Bayesian网结点聚集 - Specifically, each candidate region corresponds to a node of the graph, and each edge links two candidate regions in adjacent frames.
具体地，每一个候选区域对应图的一个结点，相邻视频帧的两个候选区域之间用边连接。 - The feature vector forwarded in this paper contains following several components: the name of document root node, the maximum and minimum eigenvalue of the corresponding matrix of document graph and valid time of root node.
本文所使用的特征向量包含如下几个分量：文档片根结点名称、文档图对应矩阵的最大最小特征值和根结点有效时间。 - In wireless ad hoc group, the process to search the trunk node and the virtual backbone formatted with the head nodes is similar to solving process of minimum connected dominating set and minimum dominating set problem in graph theory.
在无线自组网中搜索主干节点和群首形成虚拟骨干网的过程类似于图论中的最小连通支配集和最小支配集问题的求解过程。 - By graph theory, an in-depth analysis to node adjacent matrix and the judgment criterion of connected graph is performed.
结合图论知识，深入分析了节点邻接矩阵，提出了图的连通性判定准则。 - This method makes every frame of motion data a node of motion graph, and create transitions between similar postures as edges of the graph.
将运动捕获数据中的每一帧的姿势作为运动图的一个节点，再找到这些姿势中相近的姿势，为其创建运动之间的过渡，作为运动图的边。